Two-dimensional online bin packing with rotation
نویسندگان
چکیده
منابع مشابه
Two-dimensional bin packing with one-dimensional resource augmentation
The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...
متن کاملOnline Colored Bin Packing
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c ≥ 2 colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize the number of bins. In the important special case when all items have size zero, we characterize ...
متن کاملMore on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, where both item sizes are bounded from above by 1 k for some natural number k ≥ 1. We show that for every possible pair of item sizes, there is an algorithm with competitive ratio of at most (k+1) 2 k2+k+1 . We prove that...
متن کاملOnline Stochastic Bin Packing
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. Items with sizes sampled independent and identically (i.i.d.) from a distribution with integral support arrive as a stream and must be packed on arrival in bins of size B, also an integer. The size of an item is known when it arrives and t...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.04.021